Cumulative record times in a Poisson process
نویسندگان
چکیده
We obtain a strong law of large numbers and a functional central limit theorem, as t → ∞, for the number of records up to time t and the Lebesgue measure (length) of the subset of the time interval [0, t] during which the Poisson process is in a record lifetime. strong law of large numbers.
منابع مشابه
ec 2 00 7 Cumulative record times in a Poisson process
We obtain a strong law of large numbers and a functional central limit theorem, as t → ∞, for the number of records up to time t and the Lebesgue measure (length) of the subset of the time interval [0, t] during which the Poisson process is in a record lifetime. strong law of large numbers.
متن کاملBayesian change point estimation in Poisson-based control charts
Precise identification of the time when a process has changed enables process engineers to search for a potential special cause more effectively. In this paper, we develop change point estimation methods for a Poisson process in a Bayesian framework. We apply Bayesian hierarchical models to formulate the change point where there exists a step < /div> change, a linear trend and a known multip...
متن کاملModeling network traffic by a cluster Poisson input process with heavy and light-tailed file sizes
We consider a cluster Poisson model with heavy-tailed interarrival times and cluster sizes as a generalization of an infinite source Poisson model where the file sizes have a regularly varying tail distribution function or a finite second moment. One result is that this model reflects long range dependence of teletraffic data. We show that depending on the heaviness of the file sizes, the inter...
متن کاملTitle: Simulation of Nonstationary Poisson Processes
Example: The stationary Poisson process has a constant rate λ > 0 of customer arrivals. This means the interarrival time A between two consecutive customers is an exponential random variable with the cumulative distribution function A(t) = 1 − e. In order to generate the times of arrivals t1, t2, . . . of customer 1, 2, . . . starting from time t0, we use the inverse transform A−1 recursively.
متن کاملOne-for-One Period Policy and its Optimal Solution
In this paper we introduce the optimal solution for a simple and yet practical inventory policy with the important characteristic which eliminates the uncertainty in demand for suppliers. In this new policy which is different from the classical inventory policies, the time interval between any two consecutive orders is fixed and the quantity of each order is one. Assuming the fixed ordering cos...
متن کامل